Efficient Expressive Attribute-Based Encryption with Keyword Search over Prime-Order Groups

Attribute-based encryption with keyword search (ABEKS) is a novel cryptographic paradigm that can be used to implement fine-grained access control and retrieve ciphertexts without disclosing the sensitive information. It perfect combination of attribute-based (ABE) public key (PEKS). Nevertheless, most existing ABEKS schemes have limited capabilities only support single or simple conjunctive search. Due weak capability inaccurate results, it difficult apply these practical applications. In this paper, an efficient expressive (EABEKS) scheme supporting unbounded universe over prime-order groups designed, which supplies function logical connectives “AND” “OR”. The proposed not leads low computation communication costs, but also supports universe. standard model, proven secure under chosen attack plaintext attack. comparison analysis experimental results show has better performance than EABEKS in storage, costs.